%\documentclass{article}
\documentclass[a4paper,twoside]{book} %this has problems
\input{common-en.tex}

\setcounter{page}{1}

% ==================== Book flag==========================

\global\let\wholebook=\relax %without relax, we build article, else book

\graphicspath{
	{img/}
    {others/preface/}
	{datastruct/tree/binary-search-tree/}
    {sorting/insertion-sort/}
	{datastruct/tree/red-black-tree/}
    {datastruct/tree/AVL-tree/}
	{datastruct/tree/trie/}
    {datastruct/tree/suffix-tree/}
    {datastruct/tree/B-tree/}
    {datastruct/heap/binary-heap/}
    {sorting/select-sort/}
    {sorting/dc-sort/}
    {datastruct/heap/other-heaps/}
    {datastruct/elementary/queue/}
    {datastruct/elementary/sequence/}
    {search/}
    {others/appendix/list/}
}

\makeindex

\begin{document}

% set PDF properties
\hypersetup{pdftitle={algoxy},%
            pdfauthor={liuxinyu95@gmail.com},%
            pdfsubject={Computer Science},%
            pdfkeywords={Algorithm, Programming}}

% ================================================================
%                 COVER PAGE
% ================================================================

\title{{\bf \Huge Elementary Algorithms}
  \centering
  \scalebox{0.4}{\includegraphics{img/fibonacci-spiral.eps}}
            }

\author{Larry LIU Xinyu
  \thanks{{\bfseries Larry LIU Xinyu } \newline
    Version: 0.6180339887498949 \newline
    Email: liuxinyu95@gmail.com \newline
    }}

\maketitle

% ================================================================
%                 Content
% ================================================================

%\newpage
\tableofcontents
\newpage

\part{Preface}
\input{others/preface/preface-en.tex}

\part{Trees}
\input{datastruct/tree/binary-search-tree/bstree-en.tex}

\input{sorting/insertion-sort/isort-en.tex}

\input{datastruct/tree/red-black-tree/rbtree-en.tex}

\input{datastruct/tree/AVL-tree/avltree-en.tex}

\input{datastruct/tree/trie/trie-en.tex}

\input{datastruct/tree/B-tree/btree-en.tex}


\part{Heaps}
\input{datastruct/heap/binary-heap/bheap-en.tex}

\input{sorting/select-sort/ssort-en.tex}

\input{datastruct/heap/other-heaps/kheap-en.tex}


\part{Queues and Sequences}
\input{datastruct/elementary/queue/queue-en.tex}

\input{datastruct/elementary/sequence/sequence-en.tex}

\part{Sorting and Searching}
\input{sorting/dc-sort/dcsort-en.tex}

\subimport{search/}{search-en.tex}

\part{Appendix}
\appendix
%\appendixpage
\noappendicestocpagenum
\addappheadtotoc

\input{others/appendix/list/list-en.tex}

\subimport{others/appendix/rbt-del/}{rbt-del-en.tex}

\subimport{others/appendix/avltree/}{avl-proof-en.tex}

\subimport{datastruct/tree/suffix-tree/}{stree-en.tex}

\input{fdl-1.3.tex}

\printindex

\end{document}
